Dynamic Conditional Independence Models and Markov Chain Monte Carlo Methods
نویسندگان
چکیده
In dynamic statistical modeling situations, observations arise sequentially, causing the model to expand by progressive incorporation of new data items and new unknown parameters. For example, in clinical monitoring, new patient-speci c parameters are introduced with each new patient. Markov chain Monte Carlo (MCMC) might be used for posterior inference, but would need to be redone at each expansion stage. Thus such methods are often too slow for real-time implementation. By combining MCMC with importance-resampling, we show how real-time posterior updating can be e ected. The proposed dynamic sampling algorithms utilize posterior samples from previous expansion stages, and exploit conditional independence between groups of parameters to allow samples of parameters no longer of interest to be discarded, such as when a patient dies or is discharged. We apply the methods to monitoring of heart transplant recipients during infection from cytomegalovirus.
منابع مشابه
Computing p-values in conditional independence models for a contingency table
We present a Markov chain Monte Carlo (MCMC) method for generating Markov chains using Markov bases for conditional independence models for a fourway contingency table. We then describe a Markov basis characterized by Markov properties associated with a given conditional independence model and show how to use the Markov basis to generate random tables of a Markov chain. The estimates of exact p...
متن کاملMarkov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections
We consider testing independence in group-wise selections with some restrictions on combinations of choices. We present models for frequency data of selections for which it is easy to perform conditional tests by Markov chain Monte Carlo (MCMC) methods. When the restrictions on the combinations can be described in terms of a Segre-Veronese configuration, an explicit form of a Gröbner basis cons...
متن کاملSegre-Veronese configuration for testing independence in group-wise selections
We consider testing independence in group-wise selections with some restrictions on combinations of choices. We present models for frequency data of selections for which it is easy to perform conditional tests by Markov chain Monte Carlo (MCMC) methods. When the restrictions on the combinations can be described in terms of a Segre-Veronese configuration, an explicit form of a Gröbner basis cons...
متن کاملMAMBO: Discovering Association Rules Based on Conditional Independencies
We present the Mambo algorithm for the discovery of association rules. Mambo is driven by conditional independence relations between the variables instead of the minimum support restrictions of algorithms like Apriori. We argue that making use of conditional independencies is an intuitively appealing way to restrict the set of association rules considered. Since we only have a finite sample fro...
متن کاملBayesian Graphical Models for Multivariate Functional Data
Graphical models express conditional independence relationships among variables. Although methods for vector-valued data are well established, functional data graphical models remain underdeveloped. By functional data, we refer to data that are realizations of random functions varying over a continuum (e.g., images, signals). We introduce a notion of conditional independence between random func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997